Fast Recursive Computation of Krawtchouk Polynomials

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast computation of Krawtchouk moments

Article history: Received 24 May 2013 Received in revised form 18 July 2014 Accepted 29 July 2014 Available online 7 August 2014

متن کامل

More zeros of krawtchouk polynomials

Three theorems are given for the integral zeros of Krawtchouk polynomials. First, five new infinite families of integral zeros for the binary (q = 2) Krawtchouk polynomials are found. Next, a lower bound is given for the next integral zero for the degree four polynomial. Finally, three new infinite families in q are found for the degree three polynomials. The techniques used are from elementary...

متن کامل

On Krawtchouk polynomials

Krawtchouk polynomials play an important role in coding theory and are also useful in graph theory and number theory. Although the basic properties of these polynomials are known to some extent, there is, to my knowledge, no detailed development available. My aim in writing this article is to fill in this gap. Notation In the following we will use capital letters for (algebraic) polynomials, fo...

متن کامل

Zeros of Generalized Krawtchouk Polynomials

The zeros of generalized Krawtchouk polynomials are studied. Some interlacing theorems for the zeros are given. A new infinite family of integral zeros is given, and it is conjectured that these comprise most of the non-trivial zeros. The integral zeros for two families of q-Krawtchouk polynomials are classified.

متن کامل

New Bounds for Hahn and Krawtchouk Polynomials

For the Hahn and Krawtchouk polynomials orthogonal on the set {0, . . . , N} new identities for the sum of squares are derived which generalize the trigonometric identity for the Chebyshev polynomials of the first and second kind. These results are applied in order to obtain conditions (on the degree of the polynomials) such that the polynomials are bounded (on the interval [0, N ]) by their va...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Imaging and Vision

سال: 2017

ISSN: 0924-9907,1573-7683

DOI: 10.1007/s10851-017-0758-9